Nonhamiltonian 3-Connected Cubic Planar Graphs
نویسندگان
چکیده
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vertices. That all 3-connected cubic planar graphs on at most 176 vertices and with face size at most 6 are hamiltonian is also verified.
منابع مشابه
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, i.e., we count connected cubic planar graphs up to isomorphisms that fix a certain directed edge. Based on decompositions along the connectivity structure, we derive recurrence formulas for the exact number of rooted ...
متن کاملOn Cubic Planar Hypohamiltonian and Hypotraceable Graphs
We present a cubic planar hypohamiltonian graph on 70 vertices, improving the best known bound of 94 by Thomassen and derive some consequences concerning longest paths and cycles of planar 3-connected graphs. We also show that cubic planar hypohamiltonian graphs on n vertices exist for every even number n ≥ 86 and that cubic planar hypotraceable graphs exist on n vertices for every even number ...
متن کامل1 Every longest circuit of a 3-connected, K3,3-minor free graph has a chord
Carsten Thomassen conjectured that every longest circuit in a 3-connected graph has a chord. We prove the conjecture for graphs having no K3,3 minor, and consequently for planar graphs. Carsten Thomassen made the following conjecture [1, 7], where a circuit denotes a connected 2-regular graph: Conjecture 1 (Thomassen) Every longest circuit of a 3-connected graph has a chord. That conjecture has...
متن کاملCuts in matchings of 3-edge-connected cubic graphs
We discuss relations between several known (some false, some open) conjectures on 3-edgeconnected, cubic graphs and how they all fit into the same framework related to cuts in matchings. We then provide a construction of 3-edge-connected digraphs satisfying the property that for every even subgraph E, the graph obtained by contracting the edges of E is not strongly connected. This disproves a r...
متن کاملCycles containing a set of elements in cubic graphs
In this paper, obtain necessary and sufficient condition for 3-connected cubic graph to have a containing any set of nine vertices and an Vve also prove that in every 3-connected cubic planar any set of fourteen vertices and is contained in a cycle. As there is 3-connected cubic planar that of fifteen vertices and an not on any cycle, the result is the best
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 13 شماره
صفحات -
تاریخ انتشار 2000